27 research outputs found
Concerning the semantic consequence relation in first-order temporal logic
AbstractIn this paper we consider the first-order temporal logic with linear and discrete time. We prove that the set of tautologies of this logic is not arithmetical (i.e., it is neither Σ0n nor Π0n for any natural number n). Thus we show that there is no finitistic and complete axiomatization of the considered logic
A Paraconsistent ASP-like Language with Tractable Model Generation
Answer Set Programming (ASP) is nowadays a dominant rule-based knowledge
representation tool. Though existing ASP variants enjoy efficient
implementations, generating an answer set remains intractable. The goal of this
research is to define a new \asp-like rule language, 4SP, with tractable model
generation. The language combines ideas of ASP and a paraconsistent rule
language 4QL. Though 4SP shares the syntax of \asp and for each program all its
answer sets are among 4SP models, the new language differs from ASP in its
logical foundations, the intended methodology of its use and complexity of
computing models.
As we show in the paper, 4QL can be seen as a paraconsistent counterpart of
ASP programs stratified with respect to default negation. Although model
generation of well-supported models for 4QL programs is tractable, dropping
stratification makes both 4QL and ASP intractable. To retain tractability while
allowing non-stratified programs, in 4SP we introduce trial expressions
interlacing programs with hypotheses as to the truth values of default
negations. This allows us to develop a~model generation algorithm with
deterministic polynomial time complexity.
We also show relationships among 4SP, ASP and 4QL
Dual Forgetting Operators in the Context of Weakest Sufficient and Strongest Necessary Conditions
Forgetting is an important concept in knowledge representation and automated
reasoning with widespread applications across a number of disciplines. A
standard forgetting operator, characterized in [Lin and Reiter'94] in terms of
model-theoretic semantics and primarily focusing on the propositional case,
opened up a new research subarea. In this paper, a new operator called weak
forgetting, dual to standard forgetting, is introduced and both together are
shown to offer a new more uniform perspective on forgetting operators in
general. Both the weak and standard forgetting operators are characterized in
terms of entailment and inference, rather than a model theoretic semantics.
This naturally leads to a useful algorithmic perspective based on quantifier
elimination and the use of Ackermman's Lemma and its fixpoint generalization.
The strong formal relationship between standard forgetting and strongest
necessary conditions and weak forgetting and weakest sufficient conditions is
also characterized quite naturally through the entailment-based, inferential
perspective used. The framework used to characterize the dual forgetting
operators is also generalized to the first-order case and includes useful
algorithms for computing first-order forgetting operators in special cases.
Practical examples are also included to show the importance of both weak and
standard forgetting in modeling and representation
A Paraconsistent ASP-like Language with Tractable Model Generation
Answer Set Programming (ASP) is nowadays a dominant rule-based knowledge representation tool. Though existing ASP variants enjoy efficient implementations, generating an answer set remains intractable. The goal of this research is to define a new ASP-like rule language, 4SP, with tractable model generation. The language combines ideas of ASP and a paraconsistent rule language 4QL. Though 4SP shares the syntax of ASP and for each program all its answer sets are among 4SP models, the new language differs from ASP in its logical foundations, the intended methodology of its use and complexity of computing models. As we show in the paper, 4QL can be seen as a paraconsistent counterpart of ASP programs stratified with respect to default negation. Although model generation for 4QL programs is tractable, dropping stratification makes it intractable for both 4QL and ASP. To retain tractability while allowing non-stratified programs, in 4SP we introduce trial expressions interlacing programs with hypotheses as to the truth values of default negations. This allows us to develop a model generation algorithm with deterministic polynomial time complexity. We also show relationships among 4SP, ASP and 4QL.Funding agencies: This work has been supported by grant 2017/27/B/ST6/02018 of the National Science Centre Poland.</p
A Paraconsistent ASP-like Language with Tractable Model Generation
Answer Set Programming (ASP) is nowadays a dominant rule-based knowledge representation tool. Though existing ASP variants enjoy efficient implementations, generating an answer set remains intractable. The goal of this research is to define a new ASP-like rule language, 4SP, with tractable model generation. The language combines ideas of ASP and a paraconsistent rule language 4QL. Though 4SP shares the syntax of ASP and for each program all its answer sets are among 4SP models, the new language differs from ASP in its logical foundations, the intended methodology of its use and complexity of computing models. As we show in the paper, 4QL can be seen as a paraconsistent counterpart of ASP programs stratified with respect to default negation. Although model generation for 4QL programs is tractable, dropping stratification makes it intractable for both 4QL and ASP. To retain tractability while allowing non-stratified programs, in 4SP we introduce trial expressions interlacing programs with hypotheses as to the truth values of default negations. This allows us to develop a model generation algorithm with deterministic polynomial time complexity. We also show relationships among 4SP, ASP and 4QL.Funding agencies: This work has been supported by grant 2017/27/B/ST6/02018 of the National Science Centre Poland.</p
On the Correspondence Between Modal and Classical Logic: an Automated Approach
The current paper is devoted to automated techniques in the correspondence theory. The theory we deal with concerns the problem of nding classical rstorder axioms corresponding to propositional modal schemas. Given a modal schema and a semantics based method of translating propositional modal formulas into classical rst-order ones, we try to derive automatically classical rst-order formula characterizing precisely the class of frames validating the schema. The technique we consider can, in many cases, be easily applied even without any computer support. Although we mainly concentrate on Kripke semantics, the technique we apply is much more general, as it is based on elimination of second-order quantiers from formulas. We show many examples of application of the method. Those can also serve as new, automated proofs of considered correspondences. Keywords: automated theorem proving, correspondence axioms, modal logics, semantics based translation 1 Introduction A great deal of a..
A landscape and implementation framework for probabilistic rough sets using PROBLOG
Reasoning about uncertainty is one of the main cornerstones of Knowledge Representation. More recently, combining logic with probability has been of major interest. Rough set methods have been proposed for modeling incompleteness and imprecision based on indiscernibility and its generalizations and there is a large body of work in this direction. More recently, the classical theory has been generalized to include probabilistic rough set methods of which there are also a great variety of proposals. Pragmatic, easily accessible, and easy to use tools for specification and reasoning with this wide variety of methods is lacking. It is the purpose of this paper to fill in that gap where the focus will be on probabilistic rough set methods. A landscape of (probabilistic) rough set reasoning methods and the variety of choices involved in specifying them is surveyed first. While doing this, an abstract generalization of all the considered approaches is derived which subsumes each of the methods. One then shows how, via this generalization, one can specify and reason about any of these methods using PROBLOG, a popular and widely used probabilistic logic programming language based on PROBLOG. The paper also considers new techniques in this context such as the use of probabilistic target sets when defining rough sets and the use of partially specified base relations that are also probabilistic. Additionally, probabilistic approaches using tolerance spaces are proposed. The paper includes a rich set of examples and provides a framework based on a library of generic PROBLOG relations that make specification of any of these methods, straightforward, efficient and compact. Complete, ready to run PROBLOG code is included in the Appendix for all examples considered.Funding Agencies|ELLIIT Network Organization for Information and Communication Technology, Sweden; Swedish Foundation for Strategic Research SSF [RIT15-0097]; Guangdong Department of Science and Technology, China [2020A1313030098]; National Science Centre Poland [2017/27/B/ST6/02018]</p